An Entropy-View Secure Multiparty Computation Protocol Based on Semi-Honest Model
نویسندگان
چکیده
Data interaction scenarios involving multiple parties in network communities have problems of trust, data security, and reliability the parties, secure multiparty computation(SMPC) can effectively solve these problems. To address security fairness issues SMPC, this study considers that semi-honest participants lead to deviations protocol, combines information entropy mutual present an n-round exchange protocol which each participant broadcasts a relevant value round without revealing other information. The uncertainty correct outcome is blurred by round, not sure until end prevents malicious behavior ensures execution protocol. Security analysis shows our guarantees relative output obtained after completing
منابع مشابه
Round Efficient Unconditionally Secure Multiparty Computation Protocol
In this paper, we propose a round efficient unconditionally secure multiparty computation (UMPC) protocol in information theoretic model with n > 2t players, in the absence of any physical broadcast channel, which communicates O(n4) field elements per multiplication and requires O(n log(n) + D) rounds, even if up to t players are under the control of an active adversary having unbounded computi...
متن کاملSecure Multiparty Computation
A function is private if there exists a protocol that is secure; that is, no party can learn any additional information about the other parties’ inputs other than what follows from their own input and the function’s output. Previous studies have investigated multiparty computation with broadcast communication, but broadcast communication does not fully capture all secure multiparty protocols. W...
متن کاملSecure Multiparty Computation
Assume a number of parties want to compute a public function F (x1, . . . , xn) = (y1, . . . , yn). All of them want to get the correct answer, but none of them are willing to expose their secret inputs to other parties. One way to achieve this requirement is to implement the secure multiparty computation protocols. In this paper, we will make a brief introduction to secure multiparty computati...
متن کاملScalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settings even vanishes, with the number of players. Our protocol is secure against an active adversary which may adaptively corrupt up to some constant fraction of the players. The protocol can be implemented in a constant ...
متن کاملSemi-Honest Secure Multiparty Computation Can Be Insecure with Use of Even Almost Uniformly Random Number Generators
It is widely understood that we are just human beings rather than being almighty; as a result, we have always to rely on non-ideal randomness in real-world cryptosystems. In contrast, in a theoretical design of a cryptosystem, it is usually regarded as sufficient to give a security proof assuming the use of ideal randomness in the system. This gap between the theory and the real world seems to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Organizational and End User Computing
سال: 2022
ISSN: ['1546-2234', '1546-5012']
DOI: https://doi.org/10.4018/joeuc.306752